Burnside Orders, Burnside Algebras and Partition Lattices

نویسنده

  • Jonathan D. H. Smith
چکیده

The permutation representation theory of groups has been extended, through quasigroups, to one-sided left (or right) quasigroups. The current paper establishes a link with the theory of ordered sets, introducing the concept of a Burnside order that generalizes the poset of conjugacy classes of subgroups of a finite group. Use of the Burnside order leads to a simplification in the proof of key properties of the Burnside algebra of a left quasigroup. The Burnside order for a projection left quasigroup structure on a finite set is defined by the lattice of set partitions of that set, and it is shown that the general direct and restricted tensor product operations for permutation representations of the projection left quasigroup structure both coincide with the operation of intersection on partitions. In particular, the mark matrix of the Burnside algebra of a projection left quasigroup, a permutation-theoretic concept, emerges as dual to the zeta function of a partition lattice, an order-theoretic concept.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Burnside-Brauer Theorem for Table Algebras

In the character theory of finite groups the Burnside-Brauer Theorem is a wellknown result which deals with products of characters in finite groups. In this paper, we first define the character products for table algebras and then by observing the relationship between the characters of a table algebra and the characters of its quotient, we provide a condition in which the products of characters...

متن کامل

Burnside-Brauer Theorem and Character Products in Table Algebras

In this paper, we first show that the irreducible characters of a quotient table algebra modulo a normal closed subset can be viewed as the irreducible characters of the table algebra itself. Furthermore, we define the character products for table algebras and give a condition in which the products of two characters are characters. Thereafter, as a main result we state and prove the Burnside-Br...

متن کامل

Application of Computers to Questions like those of Burnside, II

We show how automorphisms can be used to reduce signiicantly the resources needed to enforce laws in p-groups. This increases the extent to which Burnside groups with prime-power exponent can be studied in detail. For example, we describe how to construct power-conjugate presentations for the restricted Burnside groups R(5; 4) and R(3; 5) which have orders 2 2728 and 5 2282 respectively. We als...

متن کامل

On the Restricted Burnside Problem

After many unsuccessful attempts to obtain a proof in the late 30s-early 40s the following weaker version of The Burnside Problem was studied: Is it true that there are only finitely many 7??-generated finite groups of exponent nl In other words the question is whether there exists a universal finite m-generated group of exponent n having all other finite m-generated groups of exponent n as hom...

متن کامل

Residuated Lattices, Regular Languages, and Burnside Problem

In this talk we are going to explore an interesting connection between the famous Burnside problem for groups, regular languages, and residuated lattices. Let K be a finitely axiomatized class of residuated lattices. Recall that the usual way of proving decidability of universal theory for K is to establish that K has the finite embeddability property (FEP) [2, 3]. It turns out that the method ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Order

دوره 34  شماره 

صفحات  -

تاریخ انتشار 2017